0.03/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n010.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 03:00:05 EDT 2022 0.13/0.34 % CPUTime : 0.19/0.46 Running higher-order on 8 cores theorem proving 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.19/0.46 # Version: 3.0pre003-ho 0.19/0.51 # Preprocessing class: HSSSSMSSSSSNSSA. 0.19/0.51 # Scheduled 8 strats onto 8 cores with 120 seconds (960 total) 0.19/0.51 # Starting post_as_ho12 with 120s (1) cores 0.19/0.51 # Starting new_bool_9 with 120s (1) cores 0.19/0.51 # Starting post_as_ho1 with 120s (1) cores 0.19/0.51 # Starting post_as_ho4 with 120s (1) cores 0.19/0.51 # Starting post_as_ho2 with 120s (1) cores 0.19/0.51 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.19/0.51 # Starting full_lambda_10 with 120s (1) cores 0.19/0.51 # Starting new_ho_8 with 120s (1) cores 0.19/0.51 # post_as_ho1 with pid 18293 completed with status 0 0.19/0.51 # Result found by post_as_ho1 0.19/0.51 # Preprocessing class: HSSSSMSSSSSNSSA. 0.19/0.51 # Scheduled 8 strats onto 8 cores with 120 seconds (960 total) 0.19/0.51 # Starting post_as_ho12 with 120s (1) cores 0.19/0.51 # Starting new_bool_9 with 120s (1) cores 0.19/0.51 # Starting post_as_ho1 with 120s (1) cores 0.19/0.51 # No SInE strategy applied 0.19/0.51 # Search class: HGHNF-FFSF11-SSSFFMBN 0.19/0.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.19/0.51 # Starting post_as_ho2 with 65s (1) cores 0.19/0.51 # post_as_ho2 with pid 18301 completed with status 9 0.19/0.51 # Starting post_as_ho1 with 13s (1) cores 0.19/0.51 # post_as_ho1 with pid 18309 completed with status 9 0.19/0.51 # Starting new_bool_9 with 11s (1) cores 0.19/0.51 # new_bool_9 with pid 18315 completed with status 9 0.19/0.51 # Starting new_ho_8 with 11s (1) cores 0.19/0.51 # new_ho_8 with pid 18323 completed with status 0 0.19/0.51 # Result found by new_ho_8 0.19/0.51 # Preprocessing class: HSSSSMSSSSSNSSA. 0.19/0.51 # Scheduled 8 strats onto 8 cores with 120 seconds (960 total) 0.19/0.51 # Starting post_as_ho12 with 120s (1) cores 0.19/0.51 # Starting new_bool_9 with 120s (1) cores 0.19/0.51 # Starting post_as_ho1 with 120s (1) cores 0.19/0.51 # No SInE strategy applied 0.19/0.51 # Search class: HGHNF-FFSF11-SSSFFMBN 0.19/0.51 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.19/0.51 # Starting post_as_ho2 with 65s (1) cores 0.19/0.51 # post_as_ho2 with pid 18301 completed with status 9 0.19/0.51 # Starting post_as_ho1 with 13s (1) cores 0.19/0.51 # post_as_ho1 with pid 18309 completed with status 9 0.19/0.51 # Starting new_bool_9 with 11s (1) cores 0.19/0.51 # new_bool_9 with pid 18315 completed with status 9 0.19/0.51 # Starting new_ho_8 with 11s (1) cores 0.19/0.51 # Preprocessing time : 0.001 s 0.19/0.51 # Presaturation interreduction done 0.19/0.51 0.19/0.51 # Proof found! 0.19/0.51 # SZS status Theorem 0.19/0.51 # SZS output start CNFRefutation 0.19/0.51 thf(decl_22, type, cS: $i > $i). 0.19/0.51 thf(decl_23, type, cQ: $i > $i). 0.19/0.51 thf(decl_24, type, cR: $i > $i > $o). 0.19/0.51 thf(decl_25, type, esk1_1: $i > $i). 0.19/0.51 thf(decl_26, type, esk2_1: $i > $i). 0.19/0.51 thf(decl_27, type, esk3_1: ($i > $o) > $i). 0.19/0.51 thf(cEO1, conjecture, (![X1:$i]:((~(?[X2:$i]:((cR @ (cS @ X1) @ (cQ @ X2))))<=>?[X3:$i]:((cR @ X1 @ (cQ @ X3)))))=>?[X4:$i > $o]:(![X1:$i]:((~((X4 @ (cS @ X1)))<=>(X4 @ X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cEO1)). 0.19/0.51 thf(c_0_1, negated_conjecture, ~((![X1:$i]:((~(?[X2:$i]:((cR @ (cS @ X1) @ (cQ @ X2))))<=>?[X3:$i]:((cR @ X1 @ (cQ @ X3)))))=>?[X4:$i > $o]:(![X1:$i]:((~(X4 @ (cS @ X1))<=>(X4 @ X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cEO1])])). 0.19/0.51 thf(c_0_2, negated_conjecture, ![X10:$i, X13:$i, X14:$i, X15:$i, X16:$i > $o]:(((((cR @ (cS @ X10) @ (cQ @ (esk1_1 @ X10)))|(cR @ X10 @ (cQ @ (esk2_1 @ X10))))&(~(cR @ X13 @ (cQ @ X14))|~(cR @ (cS @ X13) @ (cQ @ X15))))&(((X16 @ (cS @ (esk3_1 @ X16)))|~(X16 @ (esk3_1 @ X16)))&(~(X16 @ (cS @ (esk3_1 @ X16)))|(X16 @ (esk3_1 @ X16)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.19/0.51 thf(c_0_3, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:((~((cR @ X1 @ (cQ @ X2)))|~((cR @ (cS @ X1) @ (cQ @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.51 thf(c_0_4, negated_conjecture, ![X1:$i]:(((cR @ (cS @ X1) @ (cQ @ (esk1_1 @ X1)))|(cR @ X1 @ (cQ @ (esk2_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.51 thf(c_0_5, negated_conjecture, ![X4:$i > $o]:(((X4 @ (esk3_1 @ X4))|~((X4 @ (cS @ (esk3_1 @ X4)))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.51 thf(c_0_6, negated_conjecture, ![X1:$i, X2:$i]:(((cR @ X1 @ (cQ @ (esk2_1 @ X1)))|~((cR @ X1 @ (cQ @ X2))))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.19/0.51 thf(c_0_7, negated_conjecture, ![X1:$i]:(~((cR @ (cS @ (esk3_1 @ (^[Z0:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0))))))) @ (cQ @ X1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_3])). 0.19/0.51 thf(c_0_8, negated_conjecture, ![X4:$i > $o]:(((X4 @ (cS @ (esk3_1 @ X4)))|~((X4 @ (esk3_1 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.19/0.51 thf(c_0_9, negated_conjecture, ~((cR @ (esk3_1 @ (^[Z0:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0)))))) @ (cQ @ (esk2_1 @ (esk3_1 @ (^[Z0:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0)))))))))), inference(spm,[status(thm)],[c_0_7, c_0_8])). 0.19/0.51 thf(c_0_10, negated_conjecture, ![X1:$i]:(~((cR @ (esk3_1 @ (^[Z0:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0)))))) @ (cQ @ X1)))), inference(spm,[status(thm)],[c_0_9, c_0_6])). 0.19/0.51 thf(c_0_11, negated_conjecture, ![X1:$i, X2:$i]:(((cR @ X1 @ (cQ @ (esk2_1 @ X1)))|~((cR @ (cS @ (cS @ X1)) @ (cQ @ X2))))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 0.19/0.51 thf(c_0_12, negated_conjecture, ![X1:$i]:(~((cR @ (cS @ (cS @ (esk3_1 @ (^[Z0:$i]:((cR @ Z0 @ (cQ @ (esk2_1 @ Z0)))))))) @ (cQ @ X1)))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 0.19/0.51 thf(c_0_13, negated_conjecture, ![X1:$i]:(((cR @ (cS @ X1) @ (cQ @ (esk2_1 @ (cS @ X1))))|(cR @ X1 @ (cQ @ (esk2_1 @ X1))))), inference(spm,[status(thm)],[c_0_11, c_0_4])). 0.19/0.51 thf(c_0_14, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_7]), ['proof']). 0.19/0.51 # SZS output end CNFRefutation 0.19/0.51 # Parsed axioms : 4 0.19/0.51 # Removed by relevancy pruning/SinE : 0 0.19/0.51 # Initial clauses : 7 0.19/0.51 # Removed in clause preprocessing : 3 0.19/0.51 # Initial clauses in saturation : 4 0.19/0.51 # Processed clauses : 112 0.19/0.51 # ...of these trivial : 0 0.19/0.51 # ...subsumed : 78 0.19/0.51 # ...remaining for further processing : 34 0.19/0.51 # Other redundant clauses eliminated : 0 0.19/0.51 # Clauses deleted for lack of memory : 0 0.19/0.51 # Backward-subsumed : 1 0.19/0.51 # Backward-rewritten : 0 0.19/0.51 # Generated clauses : 366 0.19/0.51 # ...of the previous two non-redundant : 357 0.19/0.51 # ...aggressively subsumed : 0 0.19/0.51 # Contextual simplify-reflections : 1 0.19/0.51 # Paramodulations : 364 0.19/0.51 # Factorizations : 0 0.19/0.51 # NegExts : 0 0.19/0.51 # Equation resolutions : 2 0.19/0.51 # Propositional unsat checks : 0 0.19/0.51 # Propositional check models : 0 0.19/0.51 # Propositional check unsatisfiable : 0 0.19/0.51 # Propositional clauses : 0 0.19/0.51 # Propositional clauses after purity: 0 0.19/0.51 # Propositional unsat core size : 0 0.19/0.51 # Propositional preprocessing time : 0.000 0.19/0.51 # Propositional encoding time : 0.000 0.19/0.51 # Propositional solver time : 0.000 0.19/0.51 # Success case prop preproc time : 0.000 0.19/0.51 # Success case prop encoding time : 0.000 0.19/0.51 # Success case prop solver time : 0.000 0.19/0.51 # Current number of processed clauses : 29 0.19/0.51 # Positive orientable unit clauses : 0 0.19/0.51 # Positive unorientable unit clauses: 0 0.19/0.51 # Negative unit clauses : 5 0.19/0.51 # Non-unit-clauses : 24 0.19/0.51 # Current number of unprocessed clauses: 249 0.19/0.51 # ...number of literals in the above : 479 0.19/0.51 # Current number of archived formulas : 0 0.19/0.51 # Current number of archived clauses : 5 0.19/0.51 # Clause-clause subsumption calls (NU) : 302 0.19/0.51 # Rec. Clause-clause subsumption calls : 302 0.19/0.51 # Non-unit clause-clause subsumptions : 71 0.19/0.51 # Unit Clause-clause subsumption calls : 34 0.19/0.51 # Rewrite failures with RHS unbound : 0 0.19/0.51 # BW rewrite match attempts : 0 0.19/0.51 # BW rewrite match successes : 0 0.19/0.51 # Condensation attempts : 0 0.19/0.51 # Condensation successes : 0 0.19/0.51 # Termbank termtop insertions : 53494 0.19/0.51 0.19/0.51 # ------------------------------------------------- 0.19/0.51 # User time : 0.033 s 0.19/0.51 # System time : 0.006 s 0.19/0.51 # Total time : 0.039 s 0.19/0.51 # Maximum resident set size: 1804 pages 0.19/0.51 0.19/0.51 # ------------------------------------------------- 0.19/0.51 # User time : 0.034 s 0.19/0.51 # System time : 0.009 s 0.19/0.51 # Total time : 0.042 s 0.19/0.51 # Maximum resident set size: 1704 pages 0.19/0.51 EOF